LDC Construction with a Defined Structure

نویسندگان

  • A. Agustín
  • A. Pagès - Zamora
  • J. Vidal
چکیده

Multiple Input Multiple Output (MIMO) wireless communication systems have shown to provide large capacity increase due to different modes available in the channel. The Linear Dispersion Codes (LDCs), proposed by Bell Labs, are open-loop techniques that achieve the maximum rate in highly dispersive scenarios. However, one important point to take into account is the error probability exhibited by these codes. In this paper, we present a LDC construction scheme for any number of antennas that is based on the use of orthogonal and scrambling matrices which can achieve a near optimum rate and low Pairwise Error Probability (PEP). We named these LDCs as Quasi Orthogonal Design LDCs (QOD-LDCs) The QOD-LDCs attain an upper bound of the PEP quite similar to the one achieved by a full diversity orthogonal code for all Es/N0 values. KeywordsMIMO, Linear Dispersion Codes, Pairwise Error Probability, open-loop, full diversity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query-Efficient Locally Decodable Codes

A k-query locally decodable code (LDC) C : Σn → ΓN encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordinates of C(x), even after a constant fraction of the coordinates have been corrupted. Yekhanin (2008) constructed a 3-query LDC of subexponential length, N = exp(exp(O(log n/ log log n))), under the assumption that ...

متن کامل

Query-Efficient Locally Decodable Codes of Subexponential Length

A k-query locally decodable code (LDC) C : Σn → ΓN encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordinates of C(x), even after a constant fraction of the coordinates have been corrupted. Yekhanin (2008) constructed a 3-query LDC of subexponential length, N = exp(exp(O(log n/ log log n))), under the assumption that ...

متن کامل

On the Theory of Low-Density Convolutional Codes

Abstract – In this paper, which is the first part in a series of three, a formal theory and construction methods for low-density convolutional (LDC) codes (including turbo-codes) are presented. The principles of iterative decoding of LDC codes are formulated, and an iterative algorithm for decoding of homogeneous LDC codes is described. Some simulation results are also presented. In the followi...

متن کامل

Low-Dose-Area-Constrained Helical TomoTherapy-Based Whole Breast Radiotherapy and Dosimetric Comparison with Tangential Field-in-Field IMRT

BACKGROUND AND PURPOSE To present a novel helical TomoTherapy-based method for whole breast radiotherapy that has better dosimetry and also has acceptable low-dose regions for lungs, heart, and contralateral breast compared with tangential field-in-field IMRT (FIF-IMRT). MATERIAL AND METHODS Ten patients with left-side breast cancer were planned with low-dose-area-constrained helical TomoTher...

متن کامل

Pattern Based Lossless Data Compression

In this paper we discuss a method for lossless data compression (LDC) which relies on finding a set of patterns (each of these patterns will be called a metasymbol) in a set of data whose elements (which we will call symbols) are of arbitrary size and which is, itself, also of arbitrary size. This arbitrary data set will be called a message. In order to achieve LDC two things are necessary: a) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003